https://ogma.newcastle.edu.au/vital/access/ /manager/Index en-au 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:11550 Wed 11 Apr 2018 13:18:30 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:28645 Tue 18 Jul 2017 11:23:58 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:31695 Sat 24 Mar 2018 08:44:22 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:7792 Sat 24 Mar 2018 08:39:20 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:19509 Sat 24 Mar 2018 08:02:18 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:21755 Sat 24 Mar 2018 07:53:08 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:19305 Sat 24 Mar 2018 07:49:59 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:29677 Moore bound) are extremely rare, but much activity is focused on finding new examples of graphs or families of graph with orders approaching the bound as closely as possible. There has been recent interest in this problem as it applies to mixed graphs, in which we allow some of the edges to be undirected and some directed. A 2008 paper of Nguyen and Miller derived an upper bound on the possible number of vertices of such graphs. We show that for diameters larger than three, this bound can be reduced and we present a corrected Moore bound for mixed graphs, valid for all diameters and for all combinations of undirected and directed degrees.]]> Sat 24 Mar 2018 07:32:21 AEDT ]]>